Book Review: Finite soluble groups

Constructing Normalisers in Finite Soluble Groups

This paper describes algorithms for constructing a Hall n-subgroup H of a finite soluble group G and the normaliser No(H). If G has composition length n, then H and No(H ) can be constructed using O(n ~ log IGI) and O(n ~ log IGI) group multiplications, respectively. These algorithms may be used to construct other important subgroups such as Carter subgroups, system normalisers and relative sys...

Computing automorphisms of finite soluble groups

There is a large collection of e ective algorithms for computing information about nite soluble groups. The success in computation with these groups is primarily due to a computationally convenient representation of them by means of (special forms of) power conjugate presentations. A notable omission from this collection of algorithms is an e ective algorithm for computing the automorphism grou...

Elements of Finite Model Theory [book review]

intersections of prefrattini subgroups in finite soluble groups

‎let $h$ be a prefrattini subgroup of a soluble finite group $g$‎. ‎in the‎ ‎paper it is proved that there exist elements $x,y in g$ such that the equality‎ ‎$h cap h^x cap h^y = phi (g)$ holds‎.

Book Review

...........................